k-Point semidefinite programming bounds for equiangular lines
نویسندگان
چکیده
We give a hierarchy of $k$-point bounds extending the Delsarte-Goethals-Seidel linear programming $2$-point bound and Bachoc-Vallentin semidefinite $3$-point for spherical codes. An optimized implementation this allows us to compute~$4$, $5$, $6$-point maximum number equiangular lines in Euclidean space with fixed common angle.
منابع مشابه
A path-following infeasible interior-point algorithm for semidefinite programming
We present a new algorithm obtained by changing the search directions in the algorithm given in [8]. This algorithm is based on a new technique for finding the search direction and the strategy of the central path. At each iteration, we use only the full Nesterov-Todd (NT)step. Moreover, we obtain the currently best known iteration bound for the infeasible interior-point algorithms with full NT...
متن کاملNew Bounds for Equiangular Lines and Spherical Two-Distance Sets
The set of points in a metric space is called an s-distance set if pairwise distances between these points admit only s distinct values. Two-distance spherical sets with the set of scalar products {α,−α}, α ∈ [0, 1), are called equiangular. The problem of determining the maximal size of s-distance sets in various spaces has a long history in mathematics. We determine a new method of bounding th...
متن کاملBounds for projective codes from semidefinite programming
We apply the semidefinite programming method to derive bounds for projective codes over a finite field.
متن کاملOptimal bounds for correlations via semidefinite programming
Nonlocal boxes (NLBs) are devices that are used to generate correlated bits between two spatially separated parties. If the generated correlation is weak, it can sometimes be distilled into a stronger correlation by repeated applications of the nonlocal box. We initiate here a study of the distillation of correlations for nonlocal boxes that output quantum states rather than classical bits. We ...
متن کاملOn semidefinite programming bounds for graph bandwidth
We propose two new lower bounds on graph bandwidth and cyclic bandwidth based on semidefinite programming (SDP) relaxations of the quadratic assignment problem. We compare the new bounds with two other SDP bounds in [A. Blum, G. Konjevod, R. Ravi, and S. Vempala, Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems, Theoretical Computer Science, 235(1):25-42, 2000]...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2021
ISSN: ['0025-5610', '1436-4646']
DOI: https://doi.org/10.1007/s10107-021-01638-x